Structural complexity theory - PDFSEARCH.IO - Document Search Engine

Structural complexity theory
Results: 144

#	Item
61	A Personal View of Average-Case Complexity Russell Impagliazzo Computer Science and Engineering UC, San Diego 9500 Gilman Drive La Jolla, CA[removed] Add to Reading List Source URL: www.karlin.mff.cuni.cz Language: English - Date: 2011-12-13 09:31:41 Complexity classes Mathematical optimization Structural complexity theory Analysis of algorithms P versus NP problem NP-complete NP Time complexity P Theoretical computer science Computational complexity theory Applied mathematics
62	published as: Heylighen F[removed]): "The Growth of Structural and Functional Complexity during Evolution", in: F. Heylighen, J. Bollen & A. Riegler (eds.) The Evolution of Complexity (Kluwer Academic, Dordrecht), p[removed] Add to Reading List Source URL: pespmc1.vub.ac.be Language: English - Date: 2014-05-02 12:27:43 Evolutionary biology Complex systems theory Structure Cybernetics Complexity Francis Heylighen Evolution of biological complexity Metasystem transition Differentiation Science Systems Nature
63	Subject Information Guide Computability and Intractability MAT4CI Semester 1, 2014 Administration and contact details Host Department Host Institution Add to Reading List Source URL: research.amsi.org.au Language: English - Date: 2014-08-18 08:34:25 Computational complexity theory Structural complexity theory Mathematical optimization Computability theory NP-complete P versus NP problem NP P Low Theoretical computer science Applied mathematics Complexity classes
64	Undecidability and Intractability in Theoretical PhysicsPhysical processes are viewed as computations, and the difficulty of answering Add to Reading List Source URL: www.stephenwolfram.com Language: English - Date: 2013-09-24 11:02:15 Computability theory Theory of computation Structural complexity theory Computational problems Cellular automaton Computational irreducibility A New Kind of Science Turing machine P versus NP problem Theoretical computer science Applied mathematics Mathematics
65	From: To: Subject: Date: Linda Angelotti Add to Reading List Source URL: missioncollege.org Language: English - Date: 2013-11-07 15:56:24 Computational complexity theory Reduction Structural complexity theory
66	Measuring Rationality with the Minimum Cost of Revealed Preference Violations Mark Dean and Daniel Martin Online Appendices - Not for Publication Add to Reading List Source URL: www.econ.brown.edu Language: English - Date: 2013-06-19 07:39:31 Complexity classes NP-complete problems Mathematical optimization Structural complexity theory NP-complete NP-hard P versus NP problem NP Vertex cover Theoretical computer science Computational complexity theory Applied mathematics
67	Questions Answered. In Theory. http://cstheory.stackexchange.com∗ Perhaps you’re a computer scientist wondering how much the Axiom of Choice matters to the theorems you study and prove[21]. Perhaps you’re a mathema Add to Reading List Source URL: www.cs.utah.edu Language: English - Date: 2010-11-05 18:41:12 Complexity classes Community websites Mathematical optimization Conjectures P versus NP problem Structural complexity theory Stack Exchange Network NP-complete NP Theoretical computer science Computational complexity theory Applied mathematics
68	P, N P and Mathematics – a computational complexity perspective Avi Wigderson “P versus N P – a gift to mathematics from Computer Science” Steve Smale. Add to Reading List Source URL: www.math.ias.edu Language: English - Date: 2006-03-15 13:50:29 Complexity classes Mathematical optimization Structural complexity theory Mathematical logic P NP-complete Decision problem Algorithm Time complexity Theoretical computer science Computational complexity theory Applied mathematics
69	From: To: Subject: Date: Attachments: Add to Reading List Source URL: missioncollege.org Language: English - Date: 2013-11-07 15:56:24 Reduction Structural complexity theory Decision making Neuroscience Decision theory Applied mathematics Computational complexity theory
70	Witness Indistinguishable and Witness Hiding Protocols Uriel Feige, Adi Shamir Department of Applied Mathematics The Weizmann Institute of Science Rehovot 76100, Israel Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2004-04-12 23:16:13 Cryptographic protocols Probabilistic complexity theory Complexity classes Zero-knowledge proof Structural complexity theory Proof of knowledge Interactive proof system Non-interactive zero-knowledge proof IP Theoretical computer science Computational complexity theory Cryptography

UPDATE